An η-approximation approach to duality in mathematical programming problems involving r-invex functions
نویسندگان
چکیده
منابع مشابه
Optimality Criteria and Duality in Multiobjective Programming Involving Nonsmooth Invex Functions
Abstract. In this paper a generalization of invexity is considered in a general form, by means of the concept of K-directional derivative. Then in the case of nonlinear multiobjective programming problems where the functions involved are nondifferentiable, we established sufficient optimality conditions without any convexity assumption of the K-directional derivative. Then we obtained some dual...
متن کاملNorm–Based Approximation in Invex Multi- Objective Programming Problems
This paper addresses the problem of capturing nondominated points on convex Pareto frontiers, which are encountered in invex multi-objective programming problems. An algorithm to find a piecewise linear approximation of the nondominated set of convex Pareto frontier are applied. Index Term-Approximation, Nondominated points, Invex multi-objective problems, Block norms.
متن کاملOptimality and Duality in Nonsmooth Multiobjective Optimization Involving V-Type I Invex Functions
1 Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia 2 Department of Mathematical Sciences, Florida Institute of Techynology, Melbourne 32901, USA 3 Department of Mathematics, Aligarh Muslim University, Aligarh-202 002, India 4 Department of Mathematics, Faculty of Applied Sciences, Integral University, Lucknow 226026, India 5 D...
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملSaddle Point Criteria and Duality in Multiobjective Programming via an Η-approximation Method
In this paper, Antczak’s -approximation approach is used to prove the equivalence between optima of multiobjective programming problems and the -saddle points of the associated -approximated vector optimisation problems. We introduce an -Lagrange function for a constructed -approximated vector optimisation problem and present some modified -saddle point results. Furthermore, we construct an -ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2006
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2005.08.009